Optimal elimination for sparse symmetric systems as a graph problem.
نویسندگان
چکیده
منابع مشابه
Optimal Control for Descriptor Systems: Tracking Problem (RESEARCH NOTE)
Singular systems have been studied extensively during the last two decades due Abstract to their many practical applications. Such systems possess numerous properties not shared by the well-known state variable systems. This paper considers the linear tracking problem for the continuous-time singular systems. The Hamilton-Jacobi theory is used in order to compute the optimal control and associa...
متن کاملElimination for generic sparse polynomial systems
We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an l-dimensional coordinate affine space with l < n. The complexity of the algorithm depends polynomially on combinatorial invariants associated to the supports.
متن کاملA Local Algorithm for the Sparse Spanning Graph Problem
Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by examining only a small part of the input; yet, answers must be globally consistent and independent of prior queries. Unfortunately, maximally sparse spanning subgra...
متن کاملJoint sparse graph for FBMC/OQAM systems
As an advanced non-orthogonal multiple access (NOMA) technique, the low density signature (LDS) has never been used in filter bank multicarrier (FBMC) systems. In this paper, we model a low density weight matrix (LDWM) to utilize the intrinsic interference in FBMC systems when single-tap equalization is employed, and propose a LDS-FBMC scheme which applies LDS to FBMC signals. In addition, a jo...
متن کاملOptimal approximation of sparse hessians and its equivalence to a graph coloring problem
We consider the problem of approximating the Hessian matrix of a smooth non-linear function using a minimum number of gradient evaluations, particularly in the case that the Hessian has a known, fixed sparsity pattern. We study the class of Direct Methods for this problem, and propose two new ways of classifying Direct Methods. Examples are given that show the relationships among optimal method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quarterly of Applied Mathematics
سال: 1968
ISSN: 0033-569X,1552-4485
DOI: 10.1090/qam/233497